Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems with Generalized Mixed Equilibrium Problems
نویسندگان
چکیده
منابع مشابه
Strong convergence of modified gradient-projection algorithm for constrained convex minimization problems
In this article, a modified gradient-projection algorithm (GPA) is introduced, which combines Xu’s idea of an alternative averaged mapping approach to the GPA and the general iterative method for nonexpansive mappings in Hilbert space introduced by Marino and Xu. Under suitable conditions, it is proved that the strong convergence of the sequences generated by implicit and explicit schemes to a ...
متن کاملAlgorithm of Solutions for Solving Generalized Mixed Implicit Equilibrium Problems
A new system of generalized mixed implicit equilibrium problems is introduced and studied in real reflexive Banach space. A system of generalized equation problems is considered and its equivalence with the system of generalized mixed implicit equilibrium problems is shown. The iterative algorithm of the solutions is constructed and analyzed through a fixed point formulation of the generalized ...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملHybrid shrinking iterative solutions to convex feasibility problems and a system of generalized mixed equilibrium problems
The purpose of this paper is to propose a new hybrid shrinking iterative scheme for approximating common elements of the set of solutions to convex feasibility problems for countable families of weak relatively nonexpansive mappings of a set of solutions to a system of generalized mixed equilibrium problems. A strong convergence theorem is established in the framework of Banach spaces. The resu...
متن کاملThe CoMirror algorithm for solving nonsmooth constrained convex problems
We introduce a first-order Mirror-Descent (MD) type algorithm for solving nondifferentiable convex problems having a combination of simple constraint set X (ball, simplex, etc.) and an additional functional constraint. The method is tuned to exploit the structure of X by employing an appropriate non-Euclidean distance-like function. Convergence results and efficiency estimates are derived. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Function Spaces and Applications
سال: 2012
ISSN: 0972-6802,1758-4965
DOI: 10.1155/2012/678353